A novel multigrid method for elliptic distributed control problems
نویسندگان
چکیده
Large linear systems of saddle-point type have arisen in a wide variety applications throughout computational science and engineering. The discretizations distributed control problems structure. numerical solution has attracted considerable interest recent years. In this work, we propose novel Braess–Sarazin multigrid relaxation scheme for finite element the problems, where use stiffness matrix obtained from five-point difference method Laplacian to approximate inverse mass arising system. We apply local Fourier analysis examine smoothing properties relaxation. From our analysis, optimal factor is derived. Numerical experiments validate theoretical results. considered here shows its high efficiency robustness with respect regularization parameter grid size.
منابع مشابه
A Robust Multigrid Method for Elliptic Optimal Control Problems
We consider the discretized optimality system of a special class of elliptic optimal control problems and propose an all-at-once multigrid method for solving this discretized system. Under standard assumptions the convergence of the multigrid method and the robustness of the convergence rates with respect to the involved parameter are shown. Numerical experiments are presented for illustrating ...
متن کاملMultigrid Methods for Elliptic Optimal Control Problems
Multigrid methods for elliptic optimal control problems
متن کاملA Multigrid Scheme for Elliptic Constrained Optimal Control Problems
A multigrid scheme for the solution of constrained optimal control problems discretized by finite differences is presented. This scheme is based on a new relaxation procedure that satisfies the given constraints pointwise on the computational grid. In applications, the cases of distributed and boundary control problems with box constraints are considered. The efficient and robust computational ...
متن کاملA Novel Successive Approximation Method for Solving a Class of Optimal Control Problems
This paper presents a successive approximation method (SAM) for solving a large class of optimal control problems. The proposed analytical-approximate method, successively solves the Two-Point Boundary Value Problem (TPBVP), obtained from the Pontryagin's Maximum Principle (PMP). The convergence of this method is proved and a control design algorithm with low computational complexity is present...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2023
ISSN: ['0377-0427', '1879-1778', '0771-050X']
DOI: https://doi.org/10.1016/j.cam.2022.114771